Some Algorithms for Prime Testing Using Generalized Lehmer Functions
نویسندگان
چکیده
Let N be an odd integer thought to be prime. The properties of special functions which are generalizations of the functions of Lehmer (Ann. of Math., v. 31, 1930, pp. 419-448) are used to develop algorithms that produce information concerning the possible prime divisors of N. It is shown how the factors of N ± 1, N + 1, 2 N ± N + 1, together with the factor bounds on these numbers, may all be used to calculate lower bounds for the possible prime divisors of N. Frequently, these bounds are large enough that N may be shown to be prime. These tests were implemented on an IBM/370-158 computer and run on the pseudoprime divisors of the first 385 Fibonacci and Lucas numbers.
منابع مشابه
On Primes and Terms of Prime or 2 Index in the Lehmer Sequences
It is known that with a very small number of exceptions, for a term of a Lehmer sequence {Un( √ R,Q)} to be prime its index must be prime. For example, F4 = U4(1,−1) = 3 is prime. Also, Un(1, 2) is prime for n = 6, 8, 9, 10, 15, 25, 25, 65, while Vn(1, 2) is prime for n = 9, 12, and 20. This criterion extends to the companion Lehmer sequences {Vn( √ R,Q)}, with the exception that primality may ...
متن کاملImplementing a Fast Lucas-Lehmer Test on Programmable Graphics Hardware
The Lucas-Lehmer test provides a deterministic algorithm for testing whether, for a prime number p, Mp = 2−1 is also a prime number. The current work demonstrates that this test can be effectively implemented on a parallel graphics processing unit (GPU). The parallelization was achieved by two main parallel methods: (1) fast multiplication using parallel Fast Fourier transforms in extended prec...
متن کاملRational Quartic Reciprocity
In 1985, K. S. Williams, K. Hardy and C. Friesen [11] published a reciprocity formula that comprised all known rational quartic reciprocity laws. Their proof consisted in a long and complicated manipulation of Jacobi symbols and was subsequently simplified (and generalized) by R. Evans [3]. In this note we give a proof of their reciprocity law which is not only considerably shorter but also she...
متن کاملGENERALIZED PRINCIPAL IDEAL THEOREM FOR MODULES
The Generalized Principal Ideal Theorem is one of the cornerstones of dimension theory for Noetherian rings. For an R-module M, we identify certain submodules of M that play a role analogous to that of prime ideals in the ring R. Using this definition, we extend the Generalized Principal Ideal Theorem to modules.
متن کاملCould , or should the ancient Greeks have discovered the Lucas - Lehmer test ? ROBERT GRANGER
The Lucas-Lehmer (LL) test is the most efficient known for deterministically testing the primality of Mersenne numbers, i.e., the integers Ml = 2 l − 1, for l ≥ 1. The Mersenne numbers are so-called in honour of the French scholar Marin Mersenne (1588-1648), who in 1644 published a list of exponents l ≤ 257 which he conjectured produced all and only those Ml which are prime, for l in this range...
متن کامل